Uniform Interpolation by Resolution in Modal Logic
نویسندگان
چکیده
The problem of computing a uniform interpolant of a given formula on a sublanguage is known in Artificial Intelligence as variable forgetting. In propositional logic, there are well known methods for performing variable forgetting. Variable forgetting is more involved in modal logics, because one must forget a variable not in one world, but in several worlds. It has been shown that modal logic K has the uniform interpolation property, and a method has recently been proposed for forgetting variables in a modal formula (of mu-calculus) given in disjunctive normal form. However, there are cases where information comes naturally in a more conjunctive form. In this paper, we propose a method, based on an extension of resolution to modal logics, to perform variable forgetting for formulae in conjunctive normal form, in the modal logic K.
منابع مشابه
Uniform interpolation and the existence of sequent calculi
General conditions on sequent calculi are formulated under which the intermediate and modal logics corresponding to the calculi have uniform interpolation. It follows that the intuitionistic versions of K and KD, as well as several other intuitionistic modal logics, have uniform interpolation. It also follows that no intermediate or intuitionistic modal logic without uniform interpolation has a...
متن کاملUniform interpolation and sequent calculi in modal logic
A method is presented that connects the existence of uniform interpolants to the existence of certain sequent calculi. This method is applied to several modal logics and is shown to cover known results from the literature, such as the existence of uniform interpolants for the modal logic K. The results imply that for modal logics K4 and S4, which are known not to have uniform interpolation, cer...
متن کاملFeasible Disjunction Property and Feasible Interpolation in Modal Logic
We prove Feasible Disjunction Property for modal propositional logics K, K4, K4Grz, GL, T, S4, and S4Grz, by a uniform and simple proof based on modular modal sequent proof systems. We derive Feasible Interpolation Theorem for all the logics. Our results are weaker than Hrubeš’ obtained in [9].
متن کاملUniform interpolation and compact congruences
All seven intermediate logics admitting Craig interpolation also admit uniform interpolation; however, although the modal logic K admits both properties, its extension S4 admits only Craig interpolation and not uniform interpolation (see [1] for details and references). Uniform interpolation for a logic may be viewed as a weaker form of quantifier elimination. This idea is exploited in the mono...
متن کامل